A hybrid Jaya algorithm for reliability–redundancy allocation problems
نویسندگان
چکیده
منابع مشابه
Development of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملA Hybrid Algorithm for Global Optimization Problems
We propose a hybrid algorithm for solving global optimization problems that is based on the coupling of the Simultaneous Perturbation Stochastic Approximation (SPSA) and Newton-Krylov Interior-Point (NKIP) methods via a surrogate model. There exist verified algorithms for finding approximate global solutions, but our technique will further guarantee that such solutions satisfy physical bounds o...
متن کاملA Hybrid Algorithm for Dynamic Location Problems
In this research report a hybrid algorithm integrating genetic procedures and local search will be described which is able to solve capacitated and uncapacitated dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, closed and reopen more than once during the planning horizon. It is also possible to explicitly consider di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Optimization
سال: 2017
ISSN: 0305-215X,1029-0273
DOI: 10.1080/0305215x.2017.1337755